Auteurs
Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Auteurs » - entrée « Phokion G. Kolaitis »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
Phillipe Guyot < Phokion G. Kolaitis < Phong Nguyen  Facettes :

List of bibliographic references indexed by Phokion G. Kolaitis

Number of relevant bibliographic references: 18.
Ident.Authors (with country if any)Title
009965 (2000) Miki Hermann ; Phokion G. KolaitisUnification Algorithms Cannot Be Combined in Polynomial Time
009B78 (2000) Arnaud Durand ; Miki Hermann ; Phokion G. KolaitisSubtractive Reductions and Complete Problems for Counting Complexity Classes
009E04 (2000) Miki Hermann [France] ; Phokion G. KolaitisUnification Algorithms Cannot Be Combined in Polynomial Time
009E24 (2000) Arnaud Durand [France] ; Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Subtractive Reductions and Complete Problems for Counting Complexity Classes
00A135 (2000) Arnaud Durand [France] ; Miki Hermann [France] ; Phokion G. Kolaitis [Canada]Subtractive Reductions and Complete Problems for Counting Complexity Classes
00A333 (1999-09) Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis]On the complexity of counting the Hilbert basis of a linear Diophantine system
00A568 (1999) Miki Hermann ; Laurent Juban ; Phokion G. KolaitisOn the complexity of counting the Hilbert basis of a linear Diophantine system
00A577 (1999) Miki Hermann ; Phokion G. KolaitisComputational Complexity of Simultaneous Elementary Matching Problems
00A959 (1999) Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis]On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System
00AA28 (1999) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Computational Complexity of Simultaneous Elementary Matching Problems
00AF85 (1998) Miki Hermann ; Laurent Juban ; Phokion G. KolaitisOn the Complexity of Counting the Hilbert Basis of a Linear Diophantine System
00B613 (1998) Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis]On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System
00B883 (1997) Miki Hermann ; Phokion G. KolaitisOn the complexity of unification and disunification in commutative idempotent semigroups
00BC30 (1997) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]On the complexity of unification and disunification in commutative idempotent semigroups
00C004 (1996) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Unification algorithms cannot be combined in polynomial time
00C695 (1995) Miki Hermann [États-Unis] ; Phokion G. Kolaitis [États-Unis]The Complexity of Counting Problems in Equational Matching
00C774 (1995) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Computational complexity of simultaneous elementary matching problems
00CC77 (1994) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]The complexity of counting problems in equational matching

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Author.i -k "Phokion G. Kolaitis" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Author.i  \
                -Sk "Phokion G. Kolaitis" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Author.i
   |clé=    Phokion G. Kolaitis
}}
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022